منابع مشابه
Elementary landscape decomposition of the frequency assignment problem
The Frequency Assignment Problem (FAP) is an important problem that arises in the design of radio networks, when a channel has to be assigned to each transceiver of the network. This problem is a generalization of the graph coloring problem. In this paper we study a general version of the FAP that can include adjacent frequency constraints. Using concepts from landscapes’ theory, we prove that ...
متن کاملDEA with Missing Data: An Interval Data Assignment Approach
In the classical data envelopment analysis (DEA) models, inputs and outputs are assumed as known variables, and these models cannot deal with unknown amounts of variables directly. In recent years, there are few researches on handling missing data. This paper suggests a new interval based approach to apply missing data, which is the modified version of Kousmanen (2009) approach. First, the prop...
متن کاملAn Elementary Construction for a Non-elementary Procedure
We consider the problem of the product nite model property for binary products of modal logics. First we give a new proof for the product nite model property of the logic of products of Kripke frames, a result due to Shehtman. Then we modify the proof to obtain the same result for logics of products of Kripke frames satisfying any combination of seriality, re exivity and symmetry. We do not con...
متن کاملAn Elementary Method for Tablet
This paper proposes the creation of a method book for tabletbased instruments, evaluating pedagogical materials for traditional instruments as well as research in human-computer interaction and tablet interfaces.
متن کاملAn Elementary Dyadic Riemann Hypothesis
The connection zeta function of a finite abstract simplicial complex G is defined as zeta_L(s)=sum_x 1/lambda_x^s, where lambda_x are the eigenvalues of the connection Laplacian L defined by L(x,y)=1 if x and y intersect and 0 else. (I) As a consequence of the spectral formula chi(G)=sum_x (-1)^dim(x) = p(G)-n(G), where p(G) is the number of positive eigenvalues and n(G) is the number of negati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemical Education
سال: 1991
ISSN: 0021-9584,1938-1328
DOI: 10.1021/ed068p711.1